On ω-languages whose syntactic monoid is trivialJURGENSEN, H; THIERRIN, G.International journal of computer & information sciences. 1983, Vol 12, Num 5, pp 359-365, issn 0091-7036Article

Morphismes de Sturm = Sturm's morphismsBERSTEL, J; SEEBOLD, P.Bulletin of the Belgian Mathematical Society. Simon Stevin. 1994, Vol 1, Num 2, pp 175-189, issn 1370-1444Conference Paper

The monadic theory of morphic infinite words and generalizationsCARTON, O; THOMAS, W.Lecture notes in computer science. 2000, pp 275-284, issn 0302-9743, isbn 3-540-67901-4Conference Paper

Propriétés d'invariance des mots sturmiens = Invariance properties of Sturmian wordsPARVAIX, B.Journal de théorie des nombres de Bordeaux. 1997, Vol 9, Num 2, pp 351-369, issn 1246-7405Article

On infinite words obtained by selective substitution grammarsRANI SIROMONEY; RAJKUMAR DARE, V.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 281-295, issn 0304-3975Article

Théorie des langages et complexité des algorithmes. Journées d'Avignon, octobre 1983 = Languages theorie and algorithms complexityROZOY, B.Publications du Département de mathématiques. B. 1984, Num 6, 120 p.Conference Proceedings

Crochemore factorization of sturmian and other infinite wordsBERSTEL, Jean; SAVELLI, Alessandra.Lecture notes in computer science. 2006, pp 157-166, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 10 p.Conference Paper

The monadic theory of morphic infinite words and generalizationsCARTONS, Olivier; THOMAS, Wolfgang.Information and computation (Print). 2002, Vol 176, Num 1, pp 51-65, issn 0890-5401Article

Fixed-point characterization of context-free ∞-languagesNIWINSKI, D.Information and control. 1984, Vol 61, Num 3, pp 247-276, issn 0019-9958Article

The ω-sequence equivalence problem for DOL systems is decidableCULIK, K. II; HARJU, T.Journal of the Association for Computing Machinery. 1984, Vol 31, Num 2, pp 282-298, issn 0004-5411Article

Hiérarchie et fermeture de certaines classes de tag-systèmes = Hierarchy and closing of Somes Tag-systems classesPANSIOT, J.-J.Acta informatica. 1983, Vol 20, Num 2, pp 179-196, issn 0001-5903Article

How to decide continuity of rational functions on infinite wordsPRIEUR, Christophe.Theoretical computer science. 2002, Vol 276, Num 1-2, pp 445-447, issn 0304-3975Article

On the computational complexity of infinite wordsDURIS, Pavol; MANUCH, Jan.Lecture notes in computer science. 2001, pp 328-337, issn 0302-9743, isbn 3-540-42496-2Conference Paper

An infinite word language which is not co-CFLGRAZON, A.Information processing letters. 1987, Vol 24, Num 2, pp 81-85, issn 0020-0190Article

Transfinite rewriting semantics for term rewriting systemsLUCAS, Salvador.Lecture notes in computer science. 2001, pp 216-230, issn 0302-9743, isbn 3-540-42117-3Conference Paper

On the number of Abelian square-free words on four lettersCARPI, A.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 155-167, issn 0166-218XArticle

Viennot factorization of infinite wordsMELANCON, G.Information processing letters. 1996, Vol 60, Num 2, pp 53-57, issn 0020-0190Article

Repetitions in the Fibonacci infinite wordMIGNOSI, F; PIRILLO, G.Informatique théorique et applications (Imprimé). 1992, Vol 26, Num 3, pp 199-204, issn 0988-3754Article

Point d'orbite dense de certains langages de mots infinis = Dense orbit point of a few infinite word languagesBLANCHARD, F; MARTINEZ, S.Theoretical computer science. 1986, Vol 44, Num 1, pp 107-110, issn 0304-3975Article

Abelian complexity of infinite words associated with quadratic Parry numbersBALKOVA, L'ubomíra; BRINDA, Karel; TUREK, Ondřej et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6252-6260, issn 0304-3975, 9 p.Article

A bound for the ω-equivalence problem of polynomial DOL systemsHONKALA, Juha.Informatique théorique et applications (Imprimé). 2003, Vol 37, Num 2, pp 149-157, issn 0988-3754, 9 p.Article

Complexity of weak acceptance conditions in tree automataNEUMANN, Jakub; SZEPIETOWSKI, Andrzej; WALUKIEWICZ, Igor et al.Information processing letters. 2002, Vol 84, Num 4, pp 181-187, issn 0020-0190, 7 p.Article

A representation theorem of the suffixes of characteristic sequencesCHUAN, W.-F.Discrete applied mathematics. 1998, Vol 85, Num 1, pp 47-57, issn 0166-218XArticle

Codages de rotations et basses complexités = Coding of rotations and low complexitiesAlessandri, Pascal; Mauduit, C.1996, 67 p.Thesis

On the expressive power of temporal logic for infinite wordsCOHEN-CHESNOT, J.Theoretical computer science. 1991, Vol 83, Num 2, pp 301-312, issn 0304-3975, 12 p.Article